翻訳と辞書 |
K-graph C*-algebra : ウィキペディア英語版 | K-graph C*-algebra
In mathematics, a k-graph (or higher-rank graph, graph of rank k) is a countable category with domain and codomain maps and , together with a functor which satisfies the following factorisation property: if then there are unique with such that . == Background == The finite graph theory in a directed graph form a mathematics category under concatenation called the free object category (which is generated by a graph). The length of a path in gives a functor from this category into the natural numbers . A ''k-graph'' is a natural generalisation of this concept which was introduced in 2000 by Alex Kumjian and David Pask.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「K-graph C*-algebra」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|